Query Generalization: A Method for Interpreting Null Answers
نویسنده
چکیده
A frustrating event in the course of interaction with a database management system is query failure: a query is submitted to the database, but instead of the anticipated printout, the system responds with an empty set of da ta items. While such null answers are always correct from a technical'point of view, quite often they are unsatisfactory. Most efforts to deal with this problem have been in the context of natural language interfaces. In this paper we outline a simple mechanism for handling query failures in a typical database management system, which has only formal language interfaces, and only limited knowledge on the data it stores (such as types and relationships). The mechanism is demonstrated with the Loose Structure data model, which adopts an object-oriented, logic-based approach. Its principles, however, may be implemented with other da ta models and user interfaces. 598 EXPERT DATABASE SYSTEMS
منابع مشابه
Filtering of Unrelated Answers in a CooperativeQuery Answering System
A database system may not always return answers for a query. Such a query is called a failing query. Under normal circumstances, an empty answer would be returned in response to such queries. Cooperative query answering systems produce generalized and relevant answers when an exact answer does not exist, by enhancing the query scope and including a broader range of information. Such systems may...
متن کاملPii: S0950-5849(99)00100-7
Since a query language is used as a handy tool to obtain information from a database, users want more user-friendly and fault-tolerant query interfaces. When a query search condition does not match with the underlying database, users would rather receive approximate answers than null information by relaxing the condition. They also prefer a less rigid querying structure, one which allows for va...
متن کاملارائه روشی پویا جهت پاسخ به پرسوجوهای پیوسته تجمّعی اقتضایی
Data Streams are infinite, fast, time-stamp data elements which are received explosively. Generally, these elements need to be processed in an online, real-time way. So, algorithms to process data streams and answer queries on these streams are mostly one-pass. The execution of such algorithms has some challenges such as memory limitation, scheduling, and accuracy of answers. They will be more ...
متن کاملAn Effective Path-aware Approach for Keyword Search over Data Graphs
Abstract—Keyword Search is known as a user-friendly alternative for structured languages to retrieve information from graph-structured data. Efficient retrieving of relevant answers to a keyword query and effective ranking of these answers according to their relevance are two main challenges in the keyword search over graph-structured data. In this paper, a novel scoring function is proposed, w...
متن کاملSyntactic Similarity for Ranking Database Answers Obtained by Anti-Instantiation
Flexible query answering can be implemented in an intelligent database system by query generalization to obtain answers close to a user’s intention although not answering his query exactly. In this paper, we focus on the generalization operator “Anti-Instantiation” and investigate how syntactic similarity measures can be used to rank generalized queries with regard to their closeness to the ori...
متن کامل